TTDFT: A GPU accelerated Tucker tensor DFT code for large-scale Kohn-Sham DFT calculations
نویسندگان
چکیده
We present the Tucker tensor DFT (TTDFT) code which uses a tensor-structured algorithm with graphic processing unit (GPU) acceleration for conducting ground-state calculations on large-scale systems. The localized basis computed from an additive separable approximation to Kohn-Sham Hamiltonian. discrete problem is solved using Chebyshev filtered subspace iteration method that relies matrix-matrix multiplications of sparse symmetric Hamiltonian matrix and dense wavefunction matrix, expressed in basis. These multiplication operations, constitute most computationally intensive step solution procedure, are GPU accelerated providing ∼8-fold GPU-CPU speedup these operations largest systems studied. computational performance TTDFT presented benchmark studies aluminum nano-particles silicon quantum dots system sizes ranging up ∼7,000 atoms. Program Title: TTDFT: density functional theory CPC Library link program files: https://doi.org/10.17632/8dgmcs8ys2.1 Licensing provisions: LGPL Programming language: C/C++ External routines/libraries: TuckerMPI ( https://gitlab.com/tensors/TuckerMPI ), cuBLAS https://docs.nvidia.com/cuda/cublas/index.html cuSparse https://docs.nvidia.com/cuda/cusparse/index.html ALGLIB http://www.alglib.net/ Boost https://www.boost.org/ BLAS http://www.netlib.org/blas/ LAPACK http://www.netlib.org/lapack/ PETSc https://www.mcs.anl.gov/petsc SLEPc http://slepc.upv.es ) Nature problem: Real-space Solution method: real-space based techniques acceleration. Tensor-structured adopted computing basis, representing eigenfunctions further L 1 regularization improve sparsity efficiency parallel scalability proposed algorithm. (ChFSI) method. Additional comments including restrictions unusual features: works Troullier-Martin (TM) pseudopotentials Kleinman-Bylander form. current release supports only non-periodic local (LDA) exchange-correlation functional. This project GitHub via Git, free distributed version control software. archived at time submission this work can be found library through files DOI provided above. repository https://github.com/ttdftdev/ttdft_public .
منابع مشابه
Spectrum-splitting approach for Fermi-operator expansion in all-electron Kohn-Sham DFT calculations
We present a spectrum-splitting approach to conduct all-electron Kohn-Sham density functional theory (DFT) calculations by employing Fermi-operator expansion of the Kohn-Sham Hamiltonian. The proposed approach splits the subspace containing the occupied eigenspace into a core-subspace, spanned by the core eigenfunctions, and its complement, the valence-subspace, and thereby enables an efficient...
متن کاملMolecular Binding in Post-Kohn-Sham Orbital-Free DFT.
Molecular binding in post-Kohn-Sham orbital-free DFT is investigated, using noninteracting kinetic energy functionals that satisfy the uniform electron gas condition and which are inhomogeneous under density scaling. A parameter is introduced that quantifies binding, and a series of functionals are determined from fits to near-exact effective homogeneities and/or Kohn-Sham noninteracting kineti...
متن کاملACKS2: atom-condensed Kohn-Sham DFT approximated to second order.
A new polarizable force field (PFF), namely atom-condensed Kohn-Sham density functional theory approximated to second order (ACKS2), is proposed for the efficient computation of atomic charges and linear response properties of extended molecular systems. It is derived from Kohn-Sham density functional theory (KS-DFT), making use of two novel ingredients in the context of PFFs: (i) constrained a...
متن کاملOF THE MONTH : " Linear - scaling DFT calculations with the CONQUEST code " Linear - scaling DFT calculations with the CONQUEST code
We outline the main ideas underlying the CONQUEST code for first-principles modelling of systems containing many thousands of atoms, focusing on the algorithms used to achieve linear-scaling of the cpu and memory requirements with number of atoms, and the strategies for implementing the algorithms so as to achieve good parallel scaling on parallel computers. We note that the code can be run at ...
متن کاملA three-dimensional domain decomposition method for large-scale DFT electronic structure calculations
With tens of petaflops supercomputers already in operation and exaflops machines expected to appear within the next 10 years, efficient parallel computational methods are required to take advantage of such extreme-scale machines. In this paper, we present a three-dimensional domain decomposition scheme for enabling large-scale electronic calculations based on density functional theory (DFT) on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2023
ISSN: ['1879-2944', '0010-4655']
DOI: https://doi.org/10.1016/j.cpc.2022.108516